Generating Pictorial Storylines Via Minimum-Weight Connected Dominating Set Approximation in Multi-View Graphs

نویسندگان

چکیده

This paper introduces a novel framework for generating pictorial storylines given topics from text and image data on the Internet. Unlike traditional summarization timeline generation systems, proposed combines analysis delivers storyline containing textual, pictorial, structural information to provide sketch of topic evolution. A key idea in is use an approximate solution dominating set problem. Given collection topic-related objects consisting images their descriptions, weighted multi-view graph first constructed capture contextual temporal relationships among these objects. Then are selected by solving minimum-weighted connected problem defined this graph. Comprehensive experiments real-world sets demonstrate effectiveness framework.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Pictorial Storylines Via Minimum-Weight Connected Dominating Set Approximation in Multi-View Graphs

This paper introduces a novel framework for generating pictorial storylines for given topics from text and image data on the Internet. Unlike traditional text summarization and timeline generation systems, the proposed framework combines text and image analysis and delivers a storyline containing textual, pictorial, and structural information to provide a sketch of the topic evolution. A key id...

متن کامل

Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set

This paper presents a near-optimal distributed approximation algorithm for the minimumweight connected dominating set (MCDS) problem. We use the standard distributed message passing model called the CONGEST model in which in each round each node can send O(log n) bits to each neighbor. The presented algorithm finds an O(log n) approximation in Õ(D+ √ n) rounds, where D is the network diameter a...

متن کامل

Approximation Algorithm for Minimum Weight Connected m-Fold Dominating Set

Using connected dominating set (CDS) to serve as a virtual backbone in a wireless networks can save energy and reduce interference. Since nodes may fail due to accidental damage or energy depletion, it is desirable that the virtual backbone has some fault-tolerance. A k-connected m-fold dominating set ((k,m)-CDS) of a graph G is a node set D such that every node in V \ D has at least m neighbor...

متن کامل

On minimum connected dominating set problem in unit-ball graphs

Given a graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D such that its induced subgraph is connected and each vertex outside D has at least one neighbor in D. Approximations of minimum connected dominating sets are often used to represent a virtual routing backbone in wireless networks. This paper proposes a constant-ratio approximation a...

متن کامل

The first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs

The idea of virtual backbone has emerged to improve the efficiency of flooding based routing algorithms for wireless networks. The effectiveness of virtual backbone can be improved as its size decreases. The minimum connected dominating set (CDS) problem was used to compute minimum size virtual backbone. However, as this formulation requires the virtual backbone nodes to connect all other nodes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2021

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v26i1.8207